Some additional properties of elementary landscapes
نویسندگان
چکیده
In this work, we derive a general class of multistep composite elementary landscapes and present the first non-trivial lower (upper) bounds on local minima (maxima) associated with elementary landscapes. © 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
Quasi-elementary Landscapes and Superpositions of Elementary Landscapes
There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The term “Quasi-elementary landscapes” is introduced to describe landscapes that are “alm...
متن کاملThe theory of elementary landscapes
When joined to a stipulated neighborhood digraph, an objective function deÞned on the solution space of a real combinatorial optimization problem forms a landscape. Grover shows that landscapes satisfying a certain difference equation have properties favorable to local search. Studying only symmetric and regular neighborhood digraphs, Stadler deÞnes elementary landscapes as those which can be r...
متن کاملBanded vegetation in some Australian semi-arid landscapes: 20 years of field observations to support the development and evaluation of numerical models of vegetation pattern evolution
Periodic vegetation patterns (PVPs) are striking features of many global drylands. Although they have attracted wide research study, resulting in many hypotheses, their origin and controlling factors remain unresolved. Theoretical works dominate a large literature seeking to account for the occurrence and properties of PVPs, especially banded vegetation patterns (‘tiger bush’). In light of...
متن کاملThe characteristic landscape equation for an AR(2) landscape
Grover’s equation [L.K. Grover, Local search and the local structure of some NP-complete problems, Operations Research Letters 12 (1992)] and, equivalently, the Laplacian equation [J.W. Barnes, S. Dokov, B. Dimova, A. Solomon, A theory of elementary landscapes, Applied Mathematics Letters 16 (2003)] define an elementary landscape which has favorable properties for direct search methods. Dimova ...
متن کاملElementary Landscape Decomposition of the Hamiltonian Path Optimization Problem,
There exist local search landscapes where the evaluation function is an eigenfunction of the graph Laplacian that corresponds to the neighborhood structure of the search space. Problems that display this structure are called “Elementary Landscapes” and they have a number of special mathematical properties. The problems that are not elementary landscapes can be decomposed in a sum of elementary ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 22 شماره
صفحات -
تاریخ انتشار 2009